Error exponents for distributed detection of Markov sources
نویسندگان
چکیده
منابع مشابه
Error Exponents for Distributed Detection with Feedback'
We investigate the effects of feedback on a decentralized detection system consisting of N sensors and a detection center. It is assumed that observations are independent and identically distributed across sensors, and that each sensor compresses its observations into a fixed number of quantization levels. We consider two variations on this setup. One entails the transmission of sensor data to ...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولOptimal error exponents in hidden Markov models order estimation
We consider the estimation of the number of hidden states (the order) of a discrete-time finite-alphabet hidden Markov model (HMM). The estimators we investigate are related to code-based order estimators: penalized maximum-likelihood (ML) estimators and penalized versions of the mixture estimator introduced by Liu and Narayan. We prove strong consistency of those estimators without assuming an...
متن کاملError Exponents for a Direct Detection Optical Channel
Error exponent bounds for a noise free optical channel using a direct detection receiver are computed for the cases of Pulse Position Modulation (PPM) and for the basic channel with binary output and average intensity constraint. Some consequences are derived regarding the behavior of the interleaving scheme suggested by Massey, the optimality of the PPM format and the significance of the Ro pa...
متن کاملError Exponents for Decentralized Detection in Tree Networks
We consider the problem of decentralized detection in a sensor network consisting of nodes arranged as a tree of bounded height. We characterize the optimal error exponent under a Neyman-Pearson formulation, and show that the Type II error probability decays exponentially with the number of nodes. Surprisingly, the optimal error exponent is often the same as that corresponding to a parallel con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1994
ISSN: 0018-9448
DOI: 10.1109/18.312162